|
Decomposition in computer science, also known as ''factoring'', is breaking a complex problem or system into parts that are easier to conceive, understand, program, and maintain. == Overview == There are different types of decomposition defined in computer sciences: * In structured programming, ''algorithmic decomposition'' breaks a process down into well-defined steps. * Structured analysis breaks down a software system from the system context level to system functions and data entities as described by Tom DeMarco.〔Tom DeMarco (1978). ''Structured Analysis and System Specification. New York, NY: Yourdon, 1978. ISBN 0-917072-07-3, ISBN 978-0-917072-07-9.〕 * ''Object-oriented decomposition'', on the other hand, breaks a large system down into progressively smaller classes or objects that are responsible for some part of the problem domain. * According to Booch, algorithmic decomposition is a necessary part of object-oriented analysis and design, but object-oriented systems start with and emphasize decomposition into classes.〔Grady Booch (1994). ''Object-oriented Analysis and Design'' (2nd ed.). Redwood Cita, CA: Benjamin/Cummings. pp.16-20.〕 More generally, functional decomposition in computer science is a technique for mastering the complexity of the function of a model. A functional model of a system is thereby replaced by a series of functional models of subsystems.〔Jan Dietz (2006). ''Enterprise Ontology - Theory and Methodology''. Springer-Verlag Berlin Heidelberg.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Decomposition (computer science)」の詳細全文を読む スポンサード リンク
|